Partial Enclosure Range Searching∗

نویسندگان

  • Gregory Bint
  • Anil Maheswari
  • Subhas C. Nandy
  • Michiel Smid
چکیده

A new type of range searching problem, called the partial enclosure range searching problem, is introduced in this paper. Given a set of geometric objects S and a query region Q, our goal is to identify those objects in S which intersect the query region Q by at least a fixed proportion of their original size. Two variations of this problem are studied. In the first variation the objects in S are line segments and the objective is to count the total number of members of S so that their intersection with Q is at least a given proportion of their size. Here, Q can be an axis-parallel rectangle or a slab of arbitrary orientation. In the second variation, S is a polygon and Q is an axis-parallel rectangle. The problem is to report the area of the intersection between the polygon S and a query rectangle Q.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Results on Intersection Query Problems

We present simple algorithms for three problems belonging to the class of intersection query problems. The "rst algorithm deals with the static rectangle enclosure problem and can easily be extended to d dimensions, the second algorithm copes with the generalized c-oriented polygon intersection searching problem in two dimensions, while the third solves the static 2-dimensional dominance search...

متن کامل

Range Searching in Categorical Data: Colored Range Searching on Grid

Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query as...

متن کامل

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization

In a generalized intersection searching problem, a set, S, of colored geometrie objects is to be preprocessed so that given some query object, q, the distinct colors of the objects intersected by q can be reported efficiently or the number of such colors can be counted effi.ciently. In the dynamic setting, colored objects can be inserted into or de1eted from S. These problems generalize the wel...

متن کامل

The impact of meteorological drought and grazing on the vegetation structure in aridlands (Case study: Nakhab Forest, Khosf County)

Drought and grazing rangelands play an important role in changing the structure of vegetation and losing the biodiversity of natural ecosystems. In this research, in order to determine the effects of drought and livestock grazing on the vegetation structure of rangelands located in the Nakhab Forest of South Khorasan Province, species abundance, biodiversity, and range condition and trend were ...

متن کامل

Convection in a Tilted Square Enclosure with Various Boundary Conditions and Having Heat Generating Solid Body at its Center

In this study free convection flow and heat transfer of a fluid inside a tilted square enclosure having heat conducting and generating solid body positioned in the center of the enclosure with various thermal boundary conditions has been investigated numerically. The governing equations are transformed into non-dimensional form and the resulting partial differential equations are solved by Fini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016